Computation-Efficient Parallel Prefix
نویسنده
چکیده
We are interested in solving the prefix problem of n inputs using p < n processors on completely connected distributed-memory multicomputers (CCDMMs). This paper improves a previous work in three respects. First, the communication time of the previous algorithm is reduced significantly. Second, we show that p(p + 1)/2 < n is required for the new algorithm and the original one to be applicable. Third, we argue that for the new algorithm to be faster than other algorithms run on CCDMMs, n > p3 is required. The new algorithm can achieve linear speedup and is cost-optimal when n = Ω(p2 log p). Key-Words: Completely connected multicomputer, cost-optimal, half-duplex, linear speedup, parallel algorithms, prefix computation
منابع مشابه
New Families of Computation-Efficient Parallel Prefix Algorithms
New families of computation-efficient parallel prefix algorithms for message-passing multicomputers are presented. The first family improves the communication time of a previous family of parallel prefix algorithms; both use only half-duplex communications. Two other families adopt collective communication operations to reduce the communication times of the former two, respectively. The precond...
متن کاملNew Parallel Prefix Algorithms
New families of computation-efficient parallel prefix algorithms for message-passing multicomputers are presented. The first family improves the communication time of a previous family of parallel prefix algorithms; both use only half-duplex communications. Two other families adopt collective communication operations to reduce the communication times of the former two, respectively. These famil...
متن کاملParallel Prefix Algorithms on the Multicomputer
A family of computation-efficient parallel prefix algorithms for message-passing multicomputers are presented. The family generalizes a previous algorithm that uses only half-duplex communications, and thus can improve the running time. Several properties of the family are derived, including the number of computation steps, the number of communication steps, and the condition for effective use ...
متن کاملDesign of High-Speed Low-Power Parallel-Prefix VLSI Adders
Parallel-prefix adders offer a highly-efficient solution to the binary addition problem. Several parallel-prefix adder topologies have been presented that exhibit various area and delay characteristics. However, no methodology has been reported so far that directly aims to the reduction of switching activity of the carry-computation unit. In this paper by reformulating the carry equations, we i...
متن کاملParallel Prefix Computation in the Recursive Dual-Net
In this paper, we propose an efficient algorithm for parallel prefix computation in recursive dual-net, a newly proposed network. The recursive dual-net RDN(B) for k > 0 has (2n0) 2k/2 nodes and d0 + k links per node, where n0 and d0 are the number of nodes and the node-degree of the base network B, respectively. Assume that each node holds one data item, the communication and computation time ...
متن کاملParallel Prefix Computation and Sorting on a Recursive Dual-Net
In this paper, we propose efficient algorithms for parallel prefix computation and sorting on a recursive dual-net. The recursive dual-net RDN(B) for k > 0 has (2no)/2 nodes and d0 + k links per node, where n0 and d0 are the number of nod es and the node-degree of the base-network B, respectively. Assume that each node holds one data item, the communication and computation time complexities of ...
متن کامل